Mutual information minimization: application to Blind Source Separation
نویسندگان
چکیده
In this paper, the problem of Blind Source Separation (BSS) through mutual information minimization is addressed. For mutual information minimization, multi-variate score functions are first introduced, which can be served to construct a non-parametric “gradient” for mutual information. Then, two general gradient based approaches for minimizing mutual information in a parametric model are presented. Although, in this paper, these approaches are only used in BSS, they are quiet general, and can be applied in other mutual information optimization problems. Index Terms Mutual Information, Information theoretic learning, Gradient of mutual information, Independent Component Analysis (ICA), Blind Source Separation (BSS).
منابع مشابه
Research of Blind Signals Separation with Genetic Algorithm and Particle Swarm Optimization Based on Mutual Information
Blind source separation technique separates mixed signals blindly without any information on the mixing system. In this paper, we have used two evolutionary algorithms, namely, genetic algorithm and particle swarm optimization for blind source separation. In these techniques a novel fitness function that is based on the mutual information and high order statistics is proposed. In order to evalu...
متن کاملResearch of Blind Signals Separation with Genetic Algorithm and Particle Swarm Optimization Based on Mutual Information
Blind source separation technique separates mixed signals blindly without any information on the mixing system. In this paper, we have used two evolutionary algorithms, namely, genetic algorithm and particle swarm optimization for blind source separation. In these techniques a novel fitness function that is based on the mutual information and high order statistics is proposed. In order to evalu...
متن کاملA general approach for mutual information minimization and its application to blind source separation
In this paper, a non-parametric “gradient” of the mutual information is first introduced. It is used for showing that mutual information has no local minima. Using the introduced “gradient”, two general gradient based approaches for minimizing mutual information in a parametric model are then presented. These approaches are quite general, and principally they can be used in any mutual informati...
متن کاملBlind Source Separation by Adaptive Estimation of Score Function Difference
In this paper, an adaptive algorithm for blind source separation in linear instantaneous mixtures is proposed, and it is shown to be the optimum version of the EASI algorithm. The algorithm is based on minimization of mutual information of outputs. This minimization is done using adaptive estimation of a recently proposed non-parametric “gradient” for mutual information.
متن کاملMinimization-projection (mp) Approach for Blind Source Separation in Different Mixing Models
In this paper, a new approach for blind source separation is presented. This approach is based on minimization of the mutual information of the outputs using a nonparametric “gradient” of mutual information, followed by a projection on the parametric model of the separation structure. It is applicable to different mixing system, linear as well as nonlinear, and the algorithms derived from this ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009